/**
 * @program: LeetCode
 * @description: LeetCode : 斐波那契数列
 * @author: WXY
 * @create: 2023-01-25 19:32
 * @Version 1.0
 **/
public class Num509_fib {
    public static int fib(int n) {
        if(n < 2)return n;
        int[] dp = new int[n + 1];
        dp[0] = 0;
        dp[1] = 1;
        for (int i = 2; i <= n; i++) {
            dp[i] = dp[i - 1] + dp[i - 2];
        }
        return dp[n];
    }
}
